Exploiting coherence in hierarchical visibility algorithms
نویسندگان
چکیده
We present a series of simple improvements that make use of temporal and spatial coherence in the scope of hierarchical visibility algorithms. The hierarchy updating avoids visibility tests of certain interior nodes of the hierarchy. The visibility propagation algorithm reuses information about visibility of neighbouring spatial regions. Finally, the conservative hierarchy updating avoids visibility tests of the hierarchy nodes that are expected to remain visible. We evaluate the presented methods in the context of hierarchical visibility culling using occlusion trees. Copyright # 2002 John Wiley & Sons, Ltd.
منابع مشابه
Hierarchical Techniques for Visibility Computations
Visibility computation is crucial for computer graphics from its very beginning. The first visibility algorithms aimed to determine visible lines or surfaces in a synthesized image of a 3D scene. Nowadays there is a plethora of visibility algorithms for various applications. The thesis proposes a taxonomy of visibility problems based on the dimension of the problem-relevant line set, i.e. set o...
متن کاملA Spatially and Temporally Coherent Visibility Algorithm a Spatially and Temporally Coherent Object Space Visibility Algorithm
EEciently identifying polygons that are visible from a changing synthetic viewpoint is an important problem in computer graphics. In many complex geometric models, most parts of the model are invisible from the instantaneous viewpoint. Despite this, hidden-surface algorithms like the z-buuer or BSP tree often expend signiicant computation resources processing invisible portions of the model. In...
متن کاملDistributed Visibility Servers
This thesis describes techniques for computing conservative visibility exploiting viewpoint prediction, spatial coherence and remote visibility servers to increase the rendering performance of a walkthrough client. Identifying visible (or partially visible) geometry from an instantaneous viewpoint of a 3-D computer graphics model in real-time is an important problem in interactive computer grap...
متن کاملA Spatially and Temporally Coherent Object Space Visibility Algorithm
E ciently identifying polygons that are visible from a changing synthetic viewpoint is an important problem in computer graphics. In many complex geometric models, most parts of the model are invisible from the instantaneous viewpoint. Despite this, hidden-surface algorithms like the zbu er or BSP tree often expend signi cant computation resources processing invisible portions of the model. In ...
متن کاملExploiting coherence in 2.5-D visibility computation
Visibility computation is used to reduce the amount of geometry that must be passed to the rendering engine. The model is subdivided into subvolumes called “cells”, and the visibility algorithm computes the set of cells that can at least partly be seen from the given viewpoint Airey [Aire90] called this the “potentially visible set” (PVS). The geometry associated with these cells (walls, interi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Visualization and Computer Animation
دوره 12 شماره
صفحات -
تاریخ انتشار 2001